#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read()
{
	LL x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
LL a[10000];
bool check(LL x,LL d){
    LL sum=0;
    memset(a,0,sizeof(a));
    for(LL i=1;i<=sqrt(x);i++){
        if(x%i==0&&i*i!=x){
            a[++sum]=i;a[++sum]=x/i;
        }
        if(i*i==x){
            a[++sum]=i;
        }
    }
    sort(a+1,a+1+sum);
    for(LL i=1;i<=sum;i++){
        cout<<a[i]<<" ";
    }
    cout<<endl;
    if(sum<4) return false;

    for(LL i=1;i<=sum-1;i++){
        if(abs(a[i]-a[i+1])<d){
            return false;
        }
    }
    return true;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL d;cin>>d;

    for(LL i=6;i<=1000;i++){
        if( check(i,d)==true ){
            cout<<i<<endl;
            break;
        }
    }
  }
return 0;
}
